An elliptic curve having large integral points
نویسندگان
چکیده
منابع مشابه
Computing Integral Points on Elliptic Curves
By a famous theorem of Siegel [S], the number of integral points on an elliptic curve E over an algebraic number field K is finite. A conjecture of Lang and Demjanenko [L3] states that, for a quasiminimal model of E over K, this number is bounded by a constant depending only on the rank of E over K and on K (see also [HSi], [Zi4]). This conjecture was proved by Silverman [Si1] for elliptic curv...
متن کاملUniformity of stably integral points on elliptic
0. Introduction Let X be a variety of logarithmic general type, deened over a number eld K. Let S be a nite set of places in K and let O K;S be the ring of S-integers. Suppose that X is a model of X over Spec O K;S. As a natural generalizasion of theorems of Siegel and Faltings, It was conjectured by S. Lang and P. Vojta ((Vojta], conjecture 4.4) that the set of S-integral points X(O K;S) is no...
متن کاملMultiples of Integral Points on Elliptic Curves
If E is a minimal elliptic curve defined over Z, we obtain a bound C, depending only on the global Tamagawa number of E, such that for any point P ∈ E(Q), nP is integral for at most one value of n > C. As a corollary, we show that if E/Q is a fixed elliptic curve, then for all twists E′ of E of sufficient height, and all torsion-free, rank-one subgroups Γ ⊆ E′(Q), Γ contains at most 6 integral ...
متن کاملComputing S-Integral Points on Elliptic Curves
1. Introduction. By a famous theorem of Siegel [S], the number of integral points on an elliptic curve E over an algebraic number field K is finite. A conjecture of Lang and Demyanenko (see [L3], p. 140) states that, for a quasiminimal model of E over K, this number is bounded by a constant depending only on the rank of E over K and on K (see also [HSi], [Zi4]). This conjecture was proved by Si...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2010
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-010-0075-6